Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least...(展开全部)

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least...(展开全部)

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, op...(展开全部)

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, op...(展开全部)

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least...(展开全部)

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long a...(展开全部)

在2011年,继惊人的全球范围内获得成功的Sketching,销量超过六万本的两年里,作者Koos Eissen和Roselien Steur首次在前传里分享手绘基础。事实上,前传将是一个新书的更好的名字,因为它的目的是针对新手设计师。而且向你展示了如何绘制草图各方面的形状和形式,更像是工具书,本书带来更详细的解释,引导读者的手,带领他一步一步通过所有来自各方面的手绘问题。 本书释义清晰全面,采用循序渐进的插图,例子和技巧。你将学习使用不同的技术和掌握和如何应用在设计过程中。 它对于刚接触手绘的人是一本完美的书,比如对于艺术与设计第一学年的学生,或者那些希望巩固自己手绘基础的人;它是一种简单而有效的学习方式，所有你曾经想要知道,但从来没有为你解释过得问题将会得到解答（译By：Scatkevin）。 （EN介绍）In 2011, following t...(展开全部)

Now in its fourth edition, Nigel Warburton's best-selling book gently eases the reader into the world of philosophy. Each chapter considers a key area of philosophy, explaining and exploring the basic ideas and themes including: what is philosophy? Can you prove God exists? Is there an afterlife? How do we know right from wrong? Should you ever break the law? Is the world real...(展开全部)

Phenomenology: The Basics is a concise and engaging introduction to one of the dominant philosophical movements of the 20th century. This lively and lucid book provides an introduction to the essential phenomenological concepts that are crucial for understanding great thinkers such as Husserl, Heidegger, and Merleau-Ponty. Written by a leading expert in the field, Dan Zahavi ex...(展开全部)

The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of usefu...(展开全部)